Recognising Sketches of Euler Diagrams Augmented with Graphs

نویسندگان

  • Gem Stapleton
  • Aidan Delaney
  • Peter Rodgers
  • Beryl Plimmer
چکیده

Euler diagrams form the basis of many visual languages. Such languages are formed by augmenting Euler diagrams with graphs or shading. However, tool support for creating augmented Euler diagrams is generally limited to generic diagram editing software using mouse and keyboard interaction. A more natural and convenient mode of entry is via a sketching interface which facilitates greater cognitive focus on the task of diagram creation. Previous work has developed sketching interfaces for Euler diagrams. This paper presents the first sketch tool for Euler diagrams augmented with graphs and shading. The tool allows the creation of sketches of these diagrams via pen-based interaction. To effect the recognition process, we define heuristics for classifying strokes as either curve, node, edge, or shading. To evaluate our recognition engine, we asked 10 participants to each sketch six augmented Euler diagrams. Using the results of the study, we fine-tuned the recognizer, achieving a statistically significant improvement.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognizing Sketches of Euler Diagrams Drawn with Ellipses

Euler diagrams form the basis of a number of visual languages. However, the existing tool support for creating Euler diagrams is limited to generic diagram editing software that uses mouse and keyboard interfaces. A more natural and convenient mode of entry is via a sketching interface. In addition, it is known that sketching, as opposed to using an editing package, facilitates greater cognitiv...

متن کامل

Drawing Graphs in Euler Diagrams

We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizing system. The second stage is to find suitable locations for nodes in the zones of the Euler diagram using a force based method. The third stage is to minimize edge crossings and total edge length by swapping the loc...

متن کامل

The augmented Zagreb index, vertex connectivity and matching number of graphs

Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.

متن کامل

ترسیم نمودارها، کمکی به فرآیند طراحی معماری

Designers draw diagrams to think about architectural concepts and design concerns. Scientists are interested in programming computers to recognize and interpret design diagrams to deliver appropriate tools for the design task at hand. Researchers conducted empirical studies to find out if designers share drawing conventions when designing. The experiment results show that designers use differen...

متن کامل

Graphs on surfaces and Khovanov homology

Oriented ribbon graphs (dessins d’enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram L , there is an associated ribbon graph whose quasi-trees correspond bijectively to spanning trees of the graph obtained by checkerboard coloring L . This corresp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011